Sparse Data Representation of Random Fields
نویسندگان
چکیده
منابع مشابه
Sparse Representation for Cyclotomic Fields
Currently, all major implementations of cyclotomic fields as well as number fields, are based on a dense model where elements are represented either as dense polynomials in the generator of the field or as coefficient vectors with respect to a fixed basis. While this representation allows for the asymptotically fastest arithmetic for general elements, it is unsuitable for fields of degree > 10 ...
متن کاملSparse representation of data
The amount of electronic data available today as well as its dimensionality and complexity increases rapidly in many scientific areas including biology, (bio-)chemistry, medicine, physics and its application fields like robotics, bioinformatics or multimedia technologies. Many of these data sets are very complex but have also a simple inherent structure which allows an appropriate sparse repres...
متن کاملWhite Noise Representation of Gaussian Random Fields
We obtain a representation theorem for Banach space valued Gaussian random variables as integrals against a white noise. As a corollary we obtain necessary and sufficient conditions for the existence of a white noise representation for a Gaussian random field indexed by a measure space. We then show how existing theory for integration with respect to Gaussian processes indexed by [0, 1] can be ...
متن کاملSparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the theory of CS to include signals that are concisely represented in terms of a graphical model. In particular, we useMarkov Random Fields (MRFs) to represent sparse signals whose nonzero coefficients are clustered. Our new...
متن کاملCollaborative filtering via sparse Markov random fields
Recommender systems play a central role in providing individualized access to information and services. This paper focuses on collaborative filtering, an approach that exploits the shared structure among mind-liked users and similar items. In particular, we focus on a formal probabilistic framework known as Markov random fields (MRF). We address the open problem of structure learning and introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2009
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200910265